A congruence result for process calculi with structural axioms
نویسندگان
چکیده
Bialgebraic models of process calculi enjoy the property that bisimilarity is a congruence. Indeed, the unique morphism to the final bialgebra induces a bisimilarity relation which coincides with observational equivalence and which is a congruence with respect to the operations. However, the application of the bialgebraic approach to process calculi with structural axioms is more problematic, because of the interaction between axioms and inference rules. In this paper, we generalise a previous method proposed by the same authors to lift calculi with structural axioms to bialgebras. In order for the lifting to hold, two conditions are required: the transition rules of the calculus are in tyft format and the axioms bisimulate with respect to the lts. As a simple example of applicability of this general approach we consider CCS with replication, thus providing a compositional bialgebraic model of the calculus.
منابع مشابه
Algorithms for Extended Alpha-Equivalence and Complexity
Equality of expressions in lambda-calculi, higher-order programming languages, higher-order programming calculi and process calculi is defined as alpha-equivalence. Permutability of bindings in let-constructs and structural congruence axioms extend alpha-equivalence. We analyse these extended alpha-equivalences and show that there are calculi with polynomial time algorithms, that a multiple-bin...
متن کاملStructural Rewriting in the π-Calculus
We consider reduction in the synchronous π-calculus with replication, without sums. Usual definitions of reduction in the π-calculus use a closure w.r.t. structural congruence of processes. In this paper we operationalize structural congruence by providing a reduction relation for piprocesses which also performs necessary structural conversions explicitly by rewrite rules. As we show, a subset ...
متن کاملStates in Process Calculi
Formal reasoning about distributed algorithms (like Consensus) typically requires to analyze global states in a traditional state-based style. This is in contrast to the traditional action-based reasoning of process calculi. Nevertheless, we use domain-specific variants of the latter, as they are convenient modeling languages in which the local code of processes can be programmed explicitly, wi...
متن کاملA Compositional Coalgebraic Model of Monadic Fusion Calculus
We propose a compositional coalgebraic semantics of the Fusion calculus of Parrow and Victor in the version with explicit fusions by Gardner and Wischik. We follow a recent approach developed by the authors and previously applied to the pi-calculus for lifting calculi with structural axioms to bialgebraic models. In our model, the unique morphism to the final bialgebra induces a bisimilarity re...
متن کاملOn the decidability and complexity of the structural congruence for beta-binders
Beta-binders is a recent process calculus developed for modelling and simulating biological systems. As usual for process calculi, the semantic definition heavily relies on a structural congruence. The treatment of the structural congruence is essential for implementation. We present a subset of the calculus for which the structural congruence is decidable and a subset for which it is also effi...
متن کامل